When the length of the cyclic quorum is the shortest in distributed system, the space complexity and the time complexity of the existing quorum generation algorithm are too high, a new shortest cyclic quorum generation algorithm was presented. Based on the theory of relaxed cyclic difference set, adding elements to the quorum in turn was judged by the condition of maximum allowable number of repetitions. The simulation results show that, when the system node number is 70 to 90, the length of the cyclic quorum is the shortest and the space complexity is O(2n), the time complexity is 3.6E-03 to 6.8E-07 of that of the exhaustive search, and the time complexity of the shortest cyclic quorum generation algorithm is reduced.